Secret Image Sharing Using Pseudo-Random Sequence

نویسندگان

  • Anil Kumar
  • Navin Rajpal
  • Guru Gobind Singh
چکیده

We propose a new concept which is derived from the cryptography, the substitution of bits in the image and the visual cryptography method. Given some secret data and a set of cover images, in the proposed scheme the secret data is encrypted by the administrator, after that we select the random bit planes of the cover images using the pseudo-random sequence and modify the cover image based on these random bit planes. In our method each participant has a unique modified cover image called stegoimage. Therefore these participants are required to reconstruct the encrypted secret data without destroying of its secrecy. After that administrator decrypt the original data. Experiments show the good quality of the stego-image. The proposed scheme also prevents anyone if steal all the shares will not gaining information about the secret data.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Non-Expansion Visual Secret Sharing Scheme For Binary Image

In visual cryptography, the secret can be any written text, graphical representation, or picture. This technique, some time called visual secret sharing (VSS), allows visual information to be encrypted in such a way that the decryption can be performed by the human visual system. In this paper, a novel approach to VSS based on the use of pseudo random number generator (PRNG) that has very long ...

متن کامل

An Extended Visual Cryptography Algorithm for Quality-Improved Gray Scale Image with Sigmoid Function

Conventional visual secret sharing schemes generate noise-like random pixels on shares to hide secret images. It suffers amanagement problem, because of which dealers cannot visually identify each share. This problem is solved by the extended visual cryptography scheme (EVCS), which adds ameaningful cover image in each share. However, the previous approaches involving the EVCS for general acces...

متن کامل

k-n Secret Sharing Visual Cryptography Scheme on Color Image using Random Sequence

Visual cryptography is a special type of encryption technique where visual information (Image, Text etc) gets encrypted in such a way that decryption can be performed by Human Visual System with a computation free decryption process. The beauty of the visual secret sharing scheme is in its decryption process where without any complex cryptographic computation encrypted data is decrypted using H...

متن کامل

Random Matrices Based Image Secret Sharing

This paper presents an image secret sharing method based on some random matrices that acts as a key for secret sharing. The technique allows a secret image to be divided into four image shares with each share individually looks meaningless. To reconstruct the secret image all four shares have to be used. Any subset m (1< m ≤ 4) shares cannot get sufficient information to reveal th e secret imag...

متن کامل

A 2 out of 3 Visual Multiple Secret Sharing Method using Generalized Random Grids

Visual secret sharing by using generalized random grids is a novel approach for generating nonexpansible shares by artfully utilizing various random variables. Stacking the shares together, secret image can be revealed. This paper proposes a 2 out of 3 visual multiple secret sharing method using generalized random grids. Three secret images (A, B, C) are used for generating three non-expansible...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006